/*
 * @Date: 2021-09-08 22:23:24
 * @Author: Acckno1
 * @LastEditTime: 2021-09-08 22:31:55
 * @Description: 
 */
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <set>
#include <bitset>
#include <utility>
using namespace std;

#define mm(a, n) memset(a, n, sizeof a)
#define mk(a, b) make_pair(a, b)

const double eps = 1e-6;
const int INF = 0x3f3f3f3f;

typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int, int> PII;
typedef pair<double, double> PDD;
typedef pair<LL, LL> PLL;
typedef pair<int, LL> PIL;

inline void quickread() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
}

const int N = 1e5 + 10;

struct Node {
    int data, next;
}node[N];

int head, n, k;

int ans[4][N];
int cnt[4];


inline void solution() {
    memset(cnt, 0, sizeof cnt);
    
    cin >> head >> n >> k;
    
    for (int i = 0; i < n; i ++ ) {
        int idx = 0;
        cin >> idx;
        cin >> node[idx].data >> node[idx].next;
    }
    
    int p = head;
    while (p != -1) {
        int t = node[p].data;
        if (t < 0)
            ans[1][cnt[1] ++ ] = p;
        else if (t <= k) 
            ans[2][cnt[2] ++ ] = p;
        else 
            ans[3][cnt[3] ++ ] = p;
        p = node[p].next;
    }
    
    vector<int> v;
    for (int i = 1; i <= 3; i ++ )
        for (int j = 0; j < cnt[i]; j ++ )
            v.push_back(ans[i][j]);
    
    for (int i = 0; i < v.size() - 1; i ++ ) 
        printf("%05d %d %05d\n", v[i], node[v[i]].data, v[i + 1]);
    printf("%05d %d -1\n", v.back(), node[v.back()]);
    
}

int main() {
    freopen("input.txt", "r", stdin);
    quickread();
    solution();
    return 0;
}